An algorithm for uniform vector quantizer design
نویسندگان
چکیده
A vector quantizer maps a k-dimensional vector into one of a finite set of output vectors or “points”. Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literature for building quantizers based on these lattices. An algorithm for designing vector quantizers based on the root lattices A,, 0, , and IT, and their duals is presented. Also, a coding scheme that has general applicability to all vector quantizers is presented. A four-dimensional uniform vector quantizer is used to encode Laplacian and gamma-distributed sources at entropy rates of one and two bits / sample and is demonstrated to achieve performance that compares favorably with the rate distortion bound and other scalar and vector quantizers. Finally, an application using uniform fourand eight-dimensional vector quantizers for encoding the discrete cosine transform coefficients of an image at 0.5 bit /pel is presented, which visibly illustrates the performance advantage of vector quantization over scalar quantization.
منابع مشابه
Mapping of Pruned Tree-Structured Scalar Quantizers to Companding: A Design Strategy
Pruned tree-structured scalar quantizers are a form of non-uniform scalar quantizer that are named due to being designed via pruning a tree-structured scalar quantizer [1]. If designed via pruning a uniform tree-structured scalar quantizer, such a quantizer may be mapped to a piecewise linear compandor. An algorithm has been developed for mapping a piecewise linear compandor onto a a tree-struc...
متن کاملMismatch in high-rate entropy-constrained vector quantization
Bucklew’s high-rate vector quantizer mismatch result is extended from fixed-rate coding to variable-rate coding using a Lagrangian formulation. It is shown that if an asymptotically (high-rate) optimal sequence of variable rate codes is designed for a -dimensional probability density function (pdf) and then applied to another pdf for which is bounded, then the resulting mismatch or loss of perf...
متن کاملCoding Algorithm for Grayscale Images Based on Piecewise Uniform Quantizers
In this paper, a piecewise uniform quantizer for input samples with discrete amplitudes for Laplacian source is designed and analyzed, and its forward adaptation is done. This type of quantizers is very often used in practice for the purpose of compression and coding of already quantized signals. It is shown that the design and the adaptation of quantizers for discrete input samples are differe...
متن کاملAdaptive quantization using piecewise companding and scaling for Gaussian mixture
Quantization is fundamental to analog-to-digital converter (ADC) and signal compression. In this paper, we propose an adaptive quantizer with piecewise companding and scaling for signals of Gaussian mixture model (GMM). Our adaptive quantizer operates under three modes, each of which corresponds to different types of GMM. Moreover, we propose a reconfigurable architecture to implement our adapt...
متن کاملQuantization of LSF by Lattice Shape-Gain Vector Quantizer
This paper presents a new lattice vector quantizer, namely lattice based shape-gain vector quantizer (LSGVQ), for line spectral frequencies (LSF) quantization. LSGVQ is developed in an attempt to reduce computation time for codebook search and memory requirement for saving codewords. Optimal design method and optimal encoding algorithm are provided for LSGVQ based on optimization of the squared...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 1984